Asynchronous Process Calculi for Specification and Verification of Information Hiding Protocols
نویسنده
چکیده
iii La Nature est un temple o` u de vivants piliers Laissent parfois sortir de confuses paroles ; L'homme y passè a travers des forêts de symboles Qui l'observent avec des regards familiers. Comme de longséchos qui de loin se confondent Dans une ténébreuse et profonde unité, Vaste comme la nuit et comme la clarté, Les parfums, les couleurs et les sons se répondent.
منابع مشابه
On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP
Hardware process calculi, such as Chp (Communicating Hardware Processes), Balsa, or Haste (formerly Tangram), are a natural approach for the description of asynchronous hardware architectures. These calculi are extensions of standard process calculi with particular synchronisation features implemented using handshake protocols. In this article, we first give a structural operational semantics f...
متن کاملWeb Service Choreography Verification Using Z Formal Specification
Web Service Choreography Description Language (WS-CDL) describes and orchestrates the services interactions among multiple participants. WS-CDL verification is essential since the interactions would lead to mismatches. Existing works verify the messages ordering, the flow of messages, and the expected results from collaborations. In this paper, we present a Z specification of WS-CDL. Besides ve...
متن کاملA model for specification, composition and verification of access control policies and its application to web services
Despite significant advances in the access control domain, requirements of new computational environments like web services still raise new challenges. Lack of appropriate method for specification of access control policies (ACPs), composition, verification and analysis of them have all made the access control in the composition of web services a complicated problem. In this paper, a new indepe...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملApplying the Concurrency Workbench to the Verification of DI Circuits
In this extended abstract, we shall consider the modelling of such delay-insensitive modules and the verification of circuits that are composed out of them. More specifically, we consider some small asynchronous controllers and verify their implementation using a popular verification tool, the Concurrency Workbench (CWB) [1, 12]. The CWB is an automated tool that helps in the manipulation and a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009